3d Exploration of Uniprocessor Schedules for Dsp Algorithms
نویسندگان
چکیده
When implementing software for programmable digital signal processors (PDSPs), the design space is de ned by a complex range of constraints and optimization objectives. Three implementation metrics that are crucial in many PDSP applications are the program memory requirement (code size), data memory requirement, and execution time. This paper addresses the problem of exploring the 3-dimensional space of trade-o s that is de ned by these crucial metrics. Given a software library for a target PDSP, and a data ow-based block diagram speci cation of a DSP application in terms of this library, our objective in this paper is to compute a full range of Pareto-optimal solutions. For solving this multi-objective optimization problem, an evolutionary algorithm based approach is applied, where two di erent Pareto-optimization methods are considered. We illustrate our techniques by analyzing the trade-o fronts of a practical application for a number of well-known, commercial PDSPs. Moreover, the two evolutionary Pareto-optimization methods are quantitatively compared on nine DSP applications.
منابع مشابه
Buuer Memory Optimization in Dsp Applications an Evolutionary Approach
In the context of digital signal processing, synchronous data ow (SDF) graphs [12] are widely used for speci cation. For these, so called single appearance schedules provide program memory-optimal uniprocessor implementations. Here, bu er memoryminimized schedules are explored among these using an Evolutionary Algorithm (EA). Whereas for a restricted class of graphs, there exist optimal polynom...
متن کاملVoltage Assignment with Guaranteed Probability Satisfying Timing Constraint for Real-time Multiproceesor DSP
Dynamic Voltage Scaling (DVS) is one of the techniques used to obtain energy-saving in real-time DSP systems. In many DSP systems, some tasks contain conditional instructions that have different execution times for different inputs. Due to the uncertainties in execution time of these tasks, this paper models each varied execution time as a probabilistic random variable and solves the Voltage As...
متن کاملScheduling Periodic Task Systems to Minimize Output Jitter
Output jitter| the variation in the inter-completion times of successive jobs of the same task | is studied in the context of the preemptive uniprocessor scheduling of periodic real-time tasks. A formal quantitative model for output jitter is proposed. A list of properties that are desirable in any jitter-minimization schedule is enumerated. Algorithms are presented for generating such schedule...
متن کاملD Exploration of Software Schedules for DSP Algorithms
This paper addresses the problem of exploring trade o s between program memory data memory and execu tion time requirements D for DSP algorithms spec i ed by data ow graphs Such an exploration is of utmost importance for being able to analyze the fea sibility and range of possible software solutions as part of a hardware software codesign methodology where the target processor and the code gene...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999